Convergence of Iterative Methods Applied to Generalized Fisher Equation
نویسنده
چکیده
A generalized Fisher’s equation is solved by using the modified Adomian decomposition method MADM , variational iteration method VIM , homotopy analysis method HAM , and modified homotopy perturbation method MHPM . The approximation solution of this equation is calculated in the form of series whose components are computed easily. The existence, uniqueness, and convergence of the proposed methods are proved. Numerical example is studied to demonstrate the accuracy of the present methods.
منابع مشابه
Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملApplication of iterative method for solving fuzzy Bernoulli equation under generalized H-differentiability
In this paper, the Picard method is proposed to solve the Bernoulli equation with fuzzy initial condition under generalized H-differentiability. The existence and uniqueness of the solution and convergence of the proposed method are proved in details. Finally an example shows the accuracy of this method.
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کامل